Prime Sieve and Factorization Using Multiplication Table
نویسندگان
چکیده
منابع مشابه
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/(π(p)(logn)); here π(x) is the prime counting function. Our algorithm requires only O(π(p)n) arithmetic operations and O(π(p) log n) space. It uses the pseudosquares primality test of Lukes, Patterson, and Williams. Under the assumption of the Extended Ri...
متن کاملA Fully Distributed Prime Numbers Generation using the Wheel Sieve
This article presents a new distributed approach for generating all prime numbers up to a given limit. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the advances of the parallel computers (which have permitted to reach large limits or to obtain the previous results in a shorter time), prime numbers generation still represents an attractive domain of rese...
متن کاملFactorization of RSA-140 Using the Number Field Sieve
On February 2, 1999, we completed the factorization of the 140–digit number RSA–140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The previous record was established on April 10, 1996 by the factorization of the 130–digit number RSA–130, also with the help of NFS. The amount of computing time spent on RSA–140 was roughly twice that neede...
متن کاملErratum: Prime factorization using quantum annealing and computational algebraic geometry
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used ...
متن کاملA Space-eecient Fast Prime Number Sieve
We present a new algorithm that nds all primes up to n using at most O(n= log log n) arithmetic operations and O(n=(log n log log n)) space. This algorithm is an improvement of a linear prime number sieve due to Pritchard. Our new algorithm matches the running time of the best previous prime number sieve, but uses less space by a factor of (log n). In addition, we present the results of our imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2012
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v4n3p7